Large induced degenerate subgraphs
نویسندگان
چکیده
A graph H is d-degenerate if every subgraph of it contains a vertex of degree smaller than d. For a graph G, let ad(G) denote the maximum number of vertices of an induced d-degenerate subgraph of G. Sharp lowers bounds for %(G) in terms of the degree sequence of G are obtained, and the minimum number of edges of a graph G with n vertices and ~2(G) < m is determined precisely for all m < n.
منابع مشابه
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
A graph G is said to be a k-degenerate graph if any subgraph of G contains a vertex of degree at most k. Let κ be any non-negative function on the vertex set of G. We first define a κ-degenerate graph. Next we give an efficient algorithm to determine whether a graph is κ-degenerate. We revisit the concept of dynamic monopolies in graphs. The latter notion is used in formulation and analysis of ...
متن کاملEfficient Enumeration of Induced Subtrees in a K-Degenerate Graph
In this paper, we address the problem of enumerating all induced subtrees in an input k-degenerate graph, where an induced subtree is an acyclic and connected induced subgraph. A graph G = (V,E) is a k-degenerate graph if for any its induced subgraph has a vertex whose degree is less than or equal to k, and many real-world graphs have small degeneracies, or very close to small degeneracies. Alt...
متن کاملInduced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs
A graph is k-degenerate if every subgraph has minimum degree at most k. We provide lower bounds on the size of a maximum induced 2-degenerate subgraph in a triangle-free planar graph. We denote the size of a maximum induced 2-degenerate subgraph of a graph G by α2(G). We prove that if G is a connected triangle-free planar graph with n vertices and m edges, then α2(G) ≥ 6n−m−1 5 . By Euler’s For...
متن کاملFinding a Maximum Induced Degenerate Subgraph Faster Than 2 n
In this paper we study the problem of finding a maximum induced d-degenerate subgraph in a given n-vertex graph from the point of view of exact algorithms. We show that for any fixed d one can find a maximum induced d-degenerate subgraph in randomized (2− εd) n time, for some constant εd > 0 depending only on d. Moreover, our algorithm can be used to sample inclusion-wise maximal induced ddegen...
متن کاملOn almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs
Recall that a (hyper)graph is d-degenerate if every of its nonempty subgraphs has a vertex of degree at most d. Every d-degenerate (hyper)graph is (easily) (d + 1)colorable. A (hyper)graph is almost d-degenerate if it is not d-degenerate, but every its proper subgraph is d-degenerate. In particular, if G is almost (k − 1)-degenerate, then after deleting any edge it is k-colorable. For k ≥ 2, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 3 شماره
صفحات -
تاریخ انتشار 1987